Efficient Query Optimization for Semantic Caching Based on the Interval Constraints Method

Semantic caching is a dynamic caching strategy which deals with not only exact but also inexact similar queries, as the local cache has the capability of analyzing the incoming queries. Therefore, in this manner, each query will be carefully analyzed by the cache manager to identify the part that can be retrieved from cache from the part that needs to be retrieved from the server. This trimming process not only speeds up information retrieval but also saves on communication cost especially for mobile devices. As, these devices have limited connection time, bandwidth, and battery power. Therefore, query trimming is the key problem in semantic caching. However, the existing methods for query trimming have a number of limitations such as, inefficiency in time, space and the complexity of the algorithm used for trimming. These factors restrict in a great extent the applicability of semantic caching for many applications. In this paper we investigate the shortcomings of query trimming process and propose a new solution to improve this process.